This paper introduces a general model of matching that includes evolving public Bayesian reputations and stochastic production. Despite productive com-plementarity, assortative matching robustly fails for high discount factors, unlike in (Becker 1973). This failure holds around the highest (lowest) reputation agents for ‘high skill ’ (‘low skill’) technologies. We find that matches of likes eventually dissolve. In another life-cycle finding, young workers are paid less than their marginal product, and old workers more. Also, wages rise with tenure but need not reflect marginal products: Information rents produce non-monotone and discontinuous wage profiles. ∗An earlier version of this was circulated as “Assortative Matching, Reputation, and...
Ce Working Paper fait l'objet d'une publication in The Review of Economic Studies, Volume 84, Issue ...
The evolution of cooperation has been the focus of intense research in the social sciences, natural ...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
Consider Becker’s classic 1963 matching model, with unobserved fixed types and stochastic publicly ob...
This paper investigates the use of reputation in an economy where principals hire agents for two dif...
Evaluation relationships are pivotal for maintaining a cooperative society. A formation of the evalu...
Team production analysis are usually carried in static frameworks where employees choose neither the...
I introduce a dynamic model of learning and random meetings between a long-lived agent with unknown ...
We analyze reputation in a game between a large player and a continuum of long-lived small players i...
Abstract. This paper provides a model of directed search in which workers have private information a...
Agents work for their own reputations when young but for their firms when old. An individual with a...
Reputational career concerns provide incentives for short-lived agents to work hard, but it is well ...
A simple model of matching between two populations is proposed. Agents search for partners from the ...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
We study a dynamic bilateral matching model with private information about agents' characteristics. ...
Ce Working Paper fait l'objet d'une publication in The Review of Economic Studies, Volume 84, Issue ...
The evolution of cooperation has been the focus of intense research in the social sciences, natural ...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
Consider Becker’s classic 1963 matching model, with unobserved fixed types and stochastic publicly ob...
This paper investigates the use of reputation in an economy where principals hire agents for two dif...
Evaluation relationships are pivotal for maintaining a cooperative society. A formation of the evalu...
Team production analysis are usually carried in static frameworks where employees choose neither the...
I introduce a dynamic model of learning and random meetings between a long-lived agent with unknown ...
We analyze reputation in a game between a large player and a continuum of long-lived small players i...
Abstract. This paper provides a model of directed search in which workers have private information a...
Agents work for their own reputations when young but for their firms when old. An individual with a...
Reputational career concerns provide incentives for short-lived agents to work hard, but it is well ...
A simple model of matching between two populations is proposed. Agents search for partners from the ...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...
We study a dynamic bilateral matching model with private information about agents' characteristics. ...
Ce Working Paper fait l'objet d'une publication in The Review of Economic Studies, Volume 84, Issue ...
The evolution of cooperation has been the focus of intense research in the social sciences, natural ...
We study employment by lotto (Aldershof et al., 1999), a procedurally fair matching algorithm for th...